منابع مشابه
Monotone term decision lists
We introduce a new representation class of Boolean functions|monotone term decision lists|which combines compact representation size with tractability of essential operations. We present many properties of the class which make it an attractive alternative to traditional universal representation classes such as DNF formulas or decision trees. We study the learnability of monotone term decision l...
متن کاملLearning Monotone Term Decision Lists
We study the learnability of monotone term decision lists in the exact model of equivalence and membership queries. We show that, for any constant k 0, k-term monotone decision lists are exactly and properly learnable with n O(k) membership queries in O(n k 3) time. We also show n (k) membership queries are necessary for exact learning. In contrast, both k-term monotone decision lists (k 2) and...
متن کاملDecision Lists for Lexical Ambiguityresolution
This paper presents a statistical decision procedure for lexical ambiguity resolution. The algorithm exploits both local syntactic patterns and more distant collo-cational evidence, generating an eecient, eeective, and highly perspicuous recipe for resolving a given ambiguity. By identifying and utilizing only the single best dis-ambiguating evidence in a target context, the algorithm avoids th...
متن کاملPruning Decision Trees and Lists
Machine learning algorithms are techniques that automatically build models describing the structure at the heart of a set of data. Ideally, such models can be used to predict properties of future data points and people can use them to analyze the domain from which the data originates. Decision trees and lists are potentially powerful predictors and embody an explicit representation of the struc...
متن کاملLearning Decision Lists U sing
A decision list is an ordered list of conjunctive rules (Rivest 1987). Inductive algorithms such as AQ and CN2 learn decision lists incrementally, one rule at a time. Such algorithms face the rule overlap problem -the classification accuracy of the decision list depends on the overlap between the learned rules. Thus, even though the rules are learned in isolation, they can only be evaluated in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00043-8